How Well Does A Single-Point Crossover Mix Building Blocks with Tight Linkage?
نویسندگان
چکیده
Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. This study develops facetwise models to predict the BB mixing time and the population sizing dictated by BB mixing for single-point crossover. Empirical results are used to validate these models. The population-sizing model suggests that for moderate-to-large problems, BB mixing—instead of BB decision making and BB supply—bounds the population size required to obtain a solution of constant quality. Furthermore, the population sizing for singlepoint crossover scales as O (
منابع مشابه
Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage
Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. This study develops facetwise models to predict the BB mixing time and the population sizing dictated by BB mixing for single-point crossover. The population-sizing model suggests that for moderate-to-large problems, BB mixing – instead of BB decision making and BB supply – bounds the populati...
متن کاملUsing Chi-square Matrix to Strengthen Multi-objective Evolutionary Algorithm
Many complex engineering problems have multi-objectives where each objective is conflicting with others. However, a lot research Jiradej Ponsawat et al. 2 works in optimization by Competent Genetic Algorithm are focused on single objective methods. These algorithms work very well for single objective problems but stumble when trying to discover a large number of solutions naturally occurred in ...
متن کاملA Genetic Algorithm With Self-distancing Bits But No Overt Linkage
We present a novel representation and crossover operator for genetic algorithms. Bits are not linked to one another. Instead, the current population suggests a pseudo-distance between each pair of bits; this pseudo-distance really measures the degree to which bits appear to participate in a building block. Then crossover respects the pseudo-distance: it is clumps of nearby bits that have their ...
متن کاملSolving Additively Decomposable Functions by Building Blocks Identification
This paper proposes a way to use Building Blocks to improve solutions in Genetic Algorithm. Hard problems, for instance, Additively Decomposable Functions (ADFs) cannot be effectively solved by a standard algorithm such as Simple Genetic Algorithm. A single point crossover creates disruption of good solutions for such problems. We proposed using Building Blocks Identification and performed appr...
متن کاملA natural approach to studying schema processing
The Building Block Hypothesis (BBH) states that adaptive systems combine good partial solutions (so-called building blocks) to find increasingly better solutions. It is thought that Genetic Algorithms (GAs) implement the BBH. However, for GAs building blocks are semi-theoretical objects in that they are thought only to be implicitly exploited via the selection and crossover operations of a GA. ...
متن کامل